Search results for "FACILITY LOCATION"
showing 10 items of 12 documents
Supporting group decision makers to locate temporary relief distribution centres after sudden-onset disasters
2020
International audience; In the humanitarian response, multiple decision-makers (DMs) need to collaborate in various problems, such as locating temporary relief distribution centres (RDCs). Several studies have argued that maximising demand coverage, reducing logistics costs and minimising response time are among the critical objectives when locating RDCs after a sudden-onset disaster. However, these objectives are often conflicting and the trade-offs can considerably complicate the situation for finding a consensus.To address the challenge and support the DMs, we suggest investigating the stability of non-dominated alternatives derived from a multi-objective model based on Monte Carlo Simul…
GRASP and tabu search for the generalized dispersion problem
2021
Abstract The problem of maximizing dispersion requires the selection of a specific number of elements from a given set, in such a way that the minimum distance between the pairs of selected elements is maximized. In recent years, this problem has received a lot of attention and has been solved with many complex heuristics. However, there is a recent variant in which the selected elements have to satisfy two realistic constraints, a minimum capacity limit and a maximum budget, which in spite of its practical significance in facility location, has received little attention. In this paper, we first propose mathematical models to obtain the optimal solution of small- and medium-size instances, …
The facility location problem with capacity transfers
2020
Abstract This paper explores the concept of capacity transfer in the context of capacitated facility location problems. This is accomplished by assuming that facilities with surplus capacity/production can cooperate with those facing shortage by transferring part of that capacity/production. Such a transfer incurs a cost that nonetheless may be compensated by savings both in the installation costs and in the distribution costs. Mixed-integer mathematical programming models are proposed for the problem. A distinction is made between the case in which the triangle inequality holds for the transfer costs and the case in which it does not. We present compact models, which are enhanced with vali…
Some personal views on the current state and the future of locational analysis
1998
In this paper a group of participants of the 12th European Summer Institute which took place in Tenerife, Spain in June 1995 present their views on the state of the art and the future trends in Locational Analysis. The issues discussed include modeling aspects in discrete Location Theory, the influence of the distance function, the relation between discrete, network and continuous location, heuristic techniques, the state of technology and undesirable facility location. Some general questions are stated regarding the applicability of location models, promising research directions and the way technology affects the development of solution techniques.
Determining the best shipper sizes for sending products to customers
2014
A distribution company has to send products, packed into shippers, from the warehouse to retail shops. The number of different shipper types is regarded as a parameter given by the user, who is looking for a balance between transportation costs and stock and procurement costs. The problem is to decide the sizes of the shipper types to keep at the warehouse so as to minimize the cost of meeting the forecasted demand over the planning horizon. In this paper, we describe an integer linear programming formulation for the problem and obtaining feasible solutions. Other models, based on multiknapsack and p-median and facility location models, are for obtaining lower bounds. We study several ways …
A new compact formulation for the discrete p-dispersion problem
2017
Abstract This paper addresses the discrete p -dispersion problem (PDP) which is about selecting p facilities from a given set of candidates in such a way that the minimum distance between selected facilities is maximized. We propose a new compact formulation for this problem. In addition, we discuss two simple enhancements of the new formulation: Simple bounds on the optimal distance can be exploited to reduce the size and to increase the tightness of the model at a relatively low cost of additional computation time. Moreover, the new formulation can be further strengthened by adding valid inequalities. We present a computational study carried out over a set of large-scale test instances i…
Some recent contributions to routing and location problems
2003
CORAL 2003, a Conference on Routing and Location, washeld in Puerto de la Cruz (Tenerife, Spain) from February24–26, 2003. A wonderful place, close to the black sand ofthe beach, and a nice temperature welcomed a group ofsenior and young researchers from Canada, England,France, Germany, and Spain. Social activities were alsoprovided and sponsored by the Cabildo Insular de Tenerife(the local government) and TITSA (the public bus transpor-tation company on the island). The conference corre-sponded to the third annual meeting of a research project,funded by the Spanish Ministry of Science and Technology,developing a Decision Support System for Vehicle Routingand Facility Location Problems (SAD…
A Branch-and-Cut method for the Capacitated Location-Routing Problem
2011
International audience; Recent researches in the design of logistic networks have shown that the overall distribution cost may be excessive if routing decisions are ignored when locating depots. The Location-Routing Problem (LRP) overcomes this drawback by simultaneously tackling location and routing decisions. The aim of this paper is to propose an exact approach based on a Branch-and-Cut algorithm for solving the LRP with capacity constraints on depots and vehicles. The proposed method is based on a zero-one linear model strengthened by new families of valid inequalities. The computational evaluation on three sets of instances (34 instances in total), with 5–10 potential depots and 20–88 …
Spatial mismatch through local public employment agencies Answers from a French quasi-experiment Spatial Mismatch through Local Public Employment Age…
2015
Using the unanticipated creation of a new agency in the French region of Lyon as a quasi-natural experiment, we question whether distance to local public employment agencies (LPEAs) is a new channel for spatial mismatch. Contrary to past evidence based on aggregated data and consistently with the spatial mismatch literature, we find no evidence of a worker/agency spatial mismatch, which pleads for a resizing of the French LPEA network. However, echoing with the literature on the institutional determinants of the local public employment agencies' efficiency, we do find detrimental institutional transitory effects.
A methodology for developing evidence-based optimization models in humanitarian logistics
2022
AbstractThe growing need for humanitarian assistance has inspired an increasing amount of academic publications in the field of humanitarian logistics. Over the past two decades, the humanitarian logistics literature has developed a powerful toolbox of standardized problem formulations to address problems ranging from distribution to scheduling or locations planning. At the same time, the humanitarian field is quickly evolving, and problem formulations heavily rely on the context, leading to calls for more evidence-based research. While mixed methods research designs provide a promising avenue to embed research in the reality of the field, there is a lack of rigorous mixed methods research …